Free Wreath Product by the Quantum Permutation Group
نویسنده
چکیده
Let A be a compact quantum group, let n ∈ N∗ and let Aaut(Xn) be the quantum permutation group on n letters. A free wreath product construction A∗wAaut(Xn) is done. This construction provides new examples of quantum groups, and is useful to describe the quantum automorphism group of the n-times disjoint union of a finite connected graph.
منابع مشابه
Free Product Formulae for Quantum Permutation Groups
Associated to a finite graph X is its quantum automorphism group G(X). We prove a formula of type G(X ∗ Y ) = G(X) ∗w G(Y ), where ∗w is a free wreath product. Then we discuss representation theory of free wreath products, with the conjectural formula μ(G ∗w H) = μ(G) ⊠ μ(H), where μ is the associated spectral measure. This is verified in two situations: one using free probability techniques, t...
متن کاملWreath Decompositions of Finite Permutation Groups
There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The r...
متن کاملWreath Product Action on Generalized Boolean Algebras
Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G ∼ Sn on the generalized Boolean algebra BX(n). We explicitly block diagonalize the commutant of this action.
متن کاملRooted Wreath Products
We introduce “rooted valuation products” and use them to construct universal Abelian lattice-ordered groups (with prescribed set of components) [CHH] from the more classical theory of [Ha]. The Wreath product construction of [H] and [HMc] generalised the Abelian (lattice-ordered) group ideas to a permutation group setting to respectively give universals for transitive (`-) permutation groups wi...
متن کاملWreath Products of Permutation Classes
A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X o Y of two permutation classes X and Y is also closed, and we investigate classes Y with the property that, for any finitely based class X, the wreath product X o Y is also finitely based.
متن کامل